Non-Cooperative Target Pose Estimation based on Improved Iterative Closest Point Algorithm
نویسندگان
چکیده
For localisation of unknown non-cooperative targets in space, the existence interference points causes inaccuracy pose estimation while utilizing point cloud registration. To address this issue, paper proposes a new iterative closest (ICP) algorithm combined with distributed weights to intensify dependability and robustness target localisation. As space have not yet been extensively studied, we classify them into two broad categories, far near points. former, statistical outlier elimination is employed. latter, Gaussian weights, simultaneously valuing variation Euclidean distance from each centroid, are commingled traditional ICP algorithm. In iteration, weight matrix $W$ connection overall obtained, singular value decomposition adopted accomplish high-precision pose. Finally, experiments implemented by shooting satellite model setting position The outcomes suggest that proposed can effectively suppress enhance accuracy estimation. When number reaches about 700, average error angle superior 0.88°.
منابع مشابه
Morphological Iterative Closest Point Algorithm
This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume. Then this is used for the calculation of the closest point operator. This ...
متن کاملRobust matching of 3D contours using iterative closest point algorithm improved by M-estimation
An extension of the Iterative Closest Point matching by M-estimation is proposed for realization of robustness to non-overlapping data or outlying data in two sets of contour data or depth images for rigid bodies. An objective function which includes independent residual components for each of x, y and z coordinates is originally defined and proposed to evaluate the fitness, simultaneously deal...
متن کاملAutomated Trimmed Iterative Closest Point Algorithm
A novel method for automatic registration based on Iterative Closest Point (ICP) approach is proposed. This method uses geometric bounding containers to evaluate the optimum overlap rate of the data and model point sets.
متن کاملThe Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calculations are distributed among the processor resources. At the end of each iteration, the results of the correspondence determination are communicated back to a central processor and the current transformation is calcula...
متن کاملThe Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the Least Trimmed Squares (LTS) approach in all phases of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2022
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2022.000001